Facets for single module and multi-module capacitated lot-sizing problems without backlogging

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Facets for Single Module and Multi-Module Capacitated Lot-Sizing Problems without Backlogging

In this paper, we consider the well-known constant-batch lot-sizing problem, which we refer to as the single module capacitated lot-sizing (SMLS) problem, and multi-module capacitated lot-sizing (MMLS) problem. We provide sufficient conditions under which the (k, l, S, I) inequalities of Pochet and Wolsey (Math of OR 18: 767-785, 1993), the mixed (k, l, S, I) inequalities, derived using mixing ...

متن کامل

n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

In this paper, we introduce a generalization of the continuous mixing set (which we refer to as the continuous n-mixing set) Qm,n := {(y, v, s) ∈ ( Z× Zn−1 + )m×Rm+1 + : ∑nt=1 αty t + vi + s ≥ βi, i = 1, . . . ,m}. This set is closely related to the feasible set of the multi-module capacitated lot-sizing (MML) problem with(out) backlogging. For each n′ ∈ {1, . . . , n}, we develop a class of va...

متن کامل

An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

An Optimization Framework for Solving Capacitated Multi-level Lot-sizing Problems with Backlogging Tao Wu†, Leyuan Shi†,>, Joseph Geunes‡, Kerem Akartunalı∗ † Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706 ‡ Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611 ∗ Department of Management Science, Univ...

متن کامل

Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems

We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...

متن کامل

Probabilistic Analysis of Multi-Item Capacitated Lot Sizing Problems

This paper conducts a probabilistic analysis of an important class of heuristics for multiitem capacitated lot sizing problems. We characterize the asymptotic performance of so-called progressive interval heuristics as T , the length of the planning horizon, goes to infinity, assuming the data are realizations of a stochastic process of the following type: the vector of cost parameters follows ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2019

ISSN: 0166-218X

DOI: 10.1016/j.dam.2018.07.029